equivalence of regular expression to finite automata